#include<iostream>
using namespace std;
int main()
{
    cout<<"hellovs\n"<<endl;
    cout<<"hellovs\n"<<endl;
    cout<<"hellovs\n"<<endl;
    cout<<"hellovs\n"<<endl;
    //写一个冒泡排序样例
    int arr[] = {5, 2, 9, 1, 5, 6};
    int n = sizeof(arr)/sizeof(arr[0]);
    for(int i = 0; i < n-1; i++) {
        for(int j = 0; j < n-i-1; j++) {
            if(arr[j] > arr[j+1]) {
                swap(arr[j], arr[j+1]);
            }
        }
    }
    cout << "Sorted array: ";
    for(int i = 0; i < n; i++) {
        cout << arr[i] << " ";
    }
    cout << endl;   
    return 0;
}